Bounds, Heuristics, and Approximations for Distribution Systems
نویسندگان
چکیده
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and central control schemes. The main ideas are based on relaxing and or decomposing the system into more manageable newsvendor type subsystems. We provide bounds on optimal echelon base-stock levels and on the optimal expected cost. We show that one of the heuristics is asymptotically optimal in the number of retailers. The results of this paper provide practicaly useful techniques as well as insights into stock-positioning issues and the drivers of system performance.
منابع مشابه
Bounds for CDFs of Order Statistics Arising from INID Random Variables
In recent decades, studying order statistics arising from independent and not necessary identically distributed (INID) random variables has been a main concern for researchers. A cumulative distribution function (CDF) of these random variables (Fi:n) is a complex manipulating, long time consuming and a software-intensive tool that takes more and more times. Therefore, obtaining approximations a...
متن کاملGlobal Approximations for the Γ-order Lognormal Distribution
A generalized form of the usual Lognormal distribution, denoted with LN γ , is introduced through the γ-order Normal distribution Nγ , with its p.d.f. defined into (0,+∞). The study of the c.d.f. of LN γ is focused on a heuristic method that provides global approximations with two anchor points, at zero and at infinity. Also evaluations are provided while certain bounds are obtained.
متن کاملRelax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .
متن کاملComputable Convergence Bounds for GMRES
The purpose of this paper is to derive new computable convergence bounds for GMRES. The new bounds depend on the initial guess and are thus conceptually different from standard “worst-case” bounds. Most importantly, approximations to the new bounds can be computed from information generated during the run of a certain GMRES implementation. The approximations allow predictions of how the algorit...
متن کاملOptimization of Nonlinear Manufacturing Systems under Uncertainty
A new algorithm for the optimization of nonlinear systems under uncertainty is presented. The algorithm, based on a parametric programming framework, gives a complete map of the optimal solution in the space of the uncertain parameters, solving a minimum number of NLP subproblems and simplified multiparametric linear master problems. Through cumulative outer-approximations obtained from the sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 55 شماره
صفحات -
تاریخ انتشار 2007